Calculation of time-dependent blocking probabilities
نویسندگان
چکیده
We consider the calculation of time-dependent blocking probabilities in the M/M/n/n loss system. We present a new method which allows one to find the temporal evolution of the probability of any given state, and, in particular, that of the blocking state without the need to solve the probabilities of all the other states or to find the eigenvalues and eigenvectors of a very large matrix corresponding to the full system. The problem is motivated by a dynamic VP bandwidth management scheme of an ATM network with full traffic segregation.
منابع مشابه
Blocking Probability Bounds in Multi-service CDMA Networks
Several previous contributions have proposed calculation methods that can be used to determine the steady state (and from it the blocking probabilities) of Code Division Multiple Access (CDMA) systems. This present work extends the classical Kaufman-Roberts formula such that it becomes applicable in CDMA systems in which elastic services with state dependent instantaneous bit rate and average b...
متن کاملA Recursive Formula to Calculate the Steady State of CDMA Networks
Several previous contributions have proposed calculation methods that can be used to calculate the steady state (and from it the blocking probabilities) in CDMA systems. To our best knowledge, this present work is the first one that extends the classical Kaufman-Roberts formula such that it becomes applicable in CDMA where elastic services (with state dependent instantaneous bit rate and averag...
متن کاملA three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملAn Analytical Model for Calculating Bounds on Call Blocking Probabilities in LEO Satellite Networks
We present an analytical model for calculating upper and lower bounds for call-blocking probabilities in a LEO satellite network that carries voice calls. The method is especially useful for large systems where calculation of call-blocking probabilities are too expensive. Our method calculates upper and lower bounds very easily and produces fairly accurate results.
متن کاملQoS Equalization in a W-CDMA Cell Supporting Calls of Infinite or Finite Sources with Interference Cancelation
In this paper, a multirate loss model for the calculation of time and call congestion probabilities in a Wideband Code Division Multiple Access (W-CDMA) cell is considered. It utilizes the Bandwidth Reservation (BR) policy and supports calls generated by an infinite or finite number of users. The BR policy achieves QoS equalization by equalizing congestion probabilities among calls of different...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997